基于PC的便携式飞行模拟器三维引擎开发研究

随着模拟器体系的不断发展,模拟训练以其经济、安全、高效的特点日益在各个领域得到广泛应用。用DirectX进行三维引擎开发与研究已是当前的主流,其核心技术是DirectX图形的渲染。现以基于PC的便携式飞行模拟器三维引擎为研究对象,用C＋＋,Windows和DirectX的相关知识编程进行开发与研究。针对地景三维引擎的开发用纹理融合算法来实现。     

一种主动感知的纹理图像检索方法(英文)

基于Contourlet变换和支持向量机提出了一种新的纹理图像检索方法。在这种方法中,能量和广义高斯分布参数被用做Contourlet子带图像的特征。通过这种表示,提出了由一类和二类支持向量机组成的两阶段检索算法来完成感知相似性测度。通过具有640个纹理图像的VisTex库和具有1760个纹理图像的Brodatz库证明了所提方法的有效性。实验结果表明,对于这两个纹理库,新的纹理图像检索方法的平均检索率分别达99.38%和98.07%。     

区域求和表算法的改进

查找表技术可以使纹理过滤变得容易处理,其计算精度不再依赖于纹理的密度.目前常用的有Mipmap技术和区域求和表技术.区域求和表技术使用一张预先计算的表格,该表格的每一个值代表由纹理图像左下角和当前点所确定的长方形区域的纹理值之和,它在相同性能的情况下能提供比mipmap过滤算法更好的视觉效果.由于该算法需要更多的内存空间和内存读写次数,本文对算法进行了改进,使之更适合于硬件实现.     

GPU加速的圆弧轨迹Katsevich锥束CT重建算法

通过改进GPU的渲染到纹理策略加速锥束反投影计算,提高了圆弧轨迹Katsevich锥束CT重建算法的执行效率.在CPU中完成投影数据的滤波处理,并将其重排为四通道浮点纹理载人GPU内存;绑定2个浮点输出纹理到帧缓冲对象的不同绑定点,用于将渲染结果输出到纹理,并同时完成反投影数据的累加计算;将矩形网格编码为四叉树结构用于加速物体切片的绘制.实验结果表明,文中算法在较大锥角时仍能重建出高质量图像,并获得接近于实时的重建速度.     

基于纹理合成算法在恢复污损牌照中的应用

车牌识别系统是现在智能交通系统中信息采集的一种手段,但是由于图像模糊、字符污损、粘连等实际问题导致识别的瓶颈。文中提出了一种基于纹理合成的图像修补算法——二维表面纹理填洞算法。该算法是根据区域生长得到车牌字符污损部分的边界,即算法中的“洞”,再基于纹理片合成与Quilting算法相结合提出了一种二维表面纹理填洞算法,针对“洞”进行图像纹理修补。实验结果表明,该算法对恢复字符的完整性和修复纹理具有很强的自适应能力,极大地提高了后续的车牌字符分割和识别率。     

图像处理技术在面包烘焙品质检验中的应用

阐速了数字图像处理技术在烘焙面包品质检验中的应用,依据灰度共现矩阵算法提取图像的纹理特征,并通过二值化后的烘焙面包切片计算出其体积。试验结果表明,该方法不仅为面包烘焙品质的快速自动检验提供了客观准确的科学依据,使感官评价的指标客观化,而且经济可行。     

Analogy and duality of texture analysis by harmonics or indicators

According to the classic harmonic approach, an orientation density function (odf)f is expanded into its corresponding Fourier orthogonal series with respect to generalized spherical harmonics, and a pole density function (pdf) into its corresponding Fourier orthogonal series with respect to spherical harmonics. While pdfs are even (antipodally symmetric) functions, odfs are generally not. Therefore, the part of the odf which cannot be determined from normal diffraction pdfs can be mathematically represented as the odd portion of its series expansion. If the odff is given, the even part can be mathematically represented explicitly in terms off itself. Thus, it is possible to render maps ofharmonic orientation ghosts, and to evaluatevariants of mathematical standard odfs resulting in identical pdfs independent of pdf data. However, if only normal diffraction pdfs are known, the data-dependentvariation width of feasible odfs remained unaccessible, and within the harmonic approach a measure of confidence in a solution of the pdf-to-odf inversion problem does not exist.According to any discrete approach, an odff defined on some setG of orientations is expanded into its corresponding Fourier orthogonal series with respect to indicator functions of the elements of a partition ofG, and a pdf defined on the upper (lower) unit hemisphereS ₊ ^{3 3} into its corresponding Fourier orthogonal series with respect to indicator functions of the elements of a partition ofS ₊ ³ . The ambiguity of the pdf-to-odf inversion problem is discussed in terms of column-rank deficiency of the augmented projection matrix. The implication of the harmonic approach to split an odf into auniquely determined and anundetermined part does no longer seem to be reasonable. However, it is possible to numerically determine data-dependent confidence intervals for the Fourier coefficients with respect to the indicator functions which can be immediately interpreted as mean orientation densities within the elements of the partition ofG. Doing so for all Fourier coefficients in the finite series expansion, i.e. for all elements of the partition of the setG, eventually results in the data-dependent variation width of odfs feasible with respect to given pdf data, and to the partitions ofG andS ₊ ³ .Thus it is confirmed that the appearance of orientation ghosts, in particular correlations oftrue andghost orientation components, depends on the representation of an odf. It may be questioned whether in practical applications the implicit assumption of the harmonic method that the even part can be determined uniquely and free of error is generally a reasonable initial condition to develop ghost correction procedures.     

Horizontal Voting Ensemble Based Predictive Modeling System for ColonCancer

Colon cancer is the third most commonly diagnosed cancer in the world. Most colon AdenoCArcinoma (ACA) arises from pre-existing benign polyps in the mucosa of the bowel. Thus, detecting benign at the earliest helps reduce the mortality rate. In this work, a Predictive Modeling System (PMS) is developed for the classification of colon cancer using the Horizontal Voting Ensemble (HVE) method. Identifying different patterns in microscopic images is essential to an effective classification system. A twelve-layer deep learning architecture has been developed to extract these patterns. The developed HVE algorithm can increase the system’s performance according to the combined models from the last epochs of the proposed architecture. Ten thousand (10000) microscopic images are taken to test the classification performance of the proposed PMS with the HVE method. The microscopic images obtained from the colon tissues are classified into ACA or benign by the proposed PMS. Results prove that the proposed PMS has ~8% performance improvement over the architecture without using the HVE method. The proposed PMS for colon cancer reduces the misclassification rate and attains 99.2% of sensitivity and 99.4% of specificity. The overall accuracy of the proposed PMS is 99.3%, and without using the HVE method, it is only 91.3%.     

基于深度学习和灰度纹理特征的铁路接触网绝缘子状态检测

铁路接触网绝缘子状态检测对铁路行车安全有着 重大的意义,为解决目前人工对绝缘 子图像检测结果的不确定性,提出一种深度学习结合灰度纹理特征的检测方法。首先使用 Faster R-CNN (faster region-based convolutional neural network)目标检测算法对图像中绝缘子精确识别,再通过灰度共生矩阵对绝缘子纹理 特征进行分析提取,之后结合支持向量机将绝缘子分为正常绝缘子和异常绝缘子,实验数 据结果证明使用能量、熵、相关度3种纹理特征进行绝缘子状态分类时对实验数据中的正 常状态绝缘子的分类精度可达100%,异常状态绝缘子的分类精度达97.5%,最后依据绝缘 子图像灰度分布的周期性特点,利用灰度积分投影将异常绝缘子分为破损绝缘子和夹杂异 物绝缘子。实验结果表明所提方法可以有效对绝缘子状态进行检测分类。